Assignment mechanisms: Common preferences and information acquisition
نویسندگان
چکیده
I study costly information acquisition in a two-sided matching problem, such as applicants to schools. An applicant's utility is sum of common and idiosyncratic components. The component unknown the applicant but can be learned at cost. As learn, their preferences over schools become more heterogeneous, improving match quality. In my stylized environment, too few acquire an ordinal strategy-proof mechanism. Subsidies, disclosure applicants' priorities, affirmative action-like policies lead higher Pareto improvements. Learning may also decrease when mechanism replaces Immediate Acceptance
منابع مشابه
Assignment Preferences and Combinatorial Auctions
The bipartite matching problem and the closely related assignment problem form a cornerstone of the Networks literature. In this paper we consider the problem of a firm whose valuation function for bundles of goods is determined by an optimal assignment of goods among several agents (or tasks,) each with independent valuations for each good. Though this model of preferences may be useful on its...
متن کاملEfficient and Optimal Selling Mechanisms with Private Information Acquisition Costs∗
In auctions with private information acquisition costs, we completely characterize efficient and optimal two-stage selling mechanisms, with the first stage being the pre-screening or entry right allocation mechanism, and the second stage being the traditional private good provision mechanism. Both efficiency and optimality require the second stage mechanism to be ex post efficient. For the firs...
متن کاملEfficient and optimal mechanisms with private information acquisition costs
In auctions with private information acquisition costs, we completely characterize (socially) efficient and (revenue) optimal two-stage mechanisms, with the first stage being an entry right allocation mechanism and the second stage being a traditional private good provision mechanism. Both efficiency and revenue optimality require that the second-stage selling mechanism be ex post efficient and...
متن کاملMechanisms for efficient voting with private information about preferences
We experimentally study behavior in a simple voting game where players have private information about their preferences. With random matching, subjects overwhelmingly follow the dominant strategy to exaggerate their preferences, which leads to inefficiency. We analyze an exogenous linking mechanism suggested by Jackson and Sonnenschein (2007) as well as repeated interaction in different setting...
متن کاملDynamic Capacity Acquisition and Assignment under Uncertainty
Given a set of m resources and n tasks, the dynamic capacity acquisition and assignment problem seeks a minimum cost schedule of capacity acquisitions for the resources and the assignment of resources to tasks, over a given planning horizon of T periods. This problem arises, for example, in the integrated planning of locations and capacities of distribution centers (DCs), and the assignment of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2021
ISSN: ['1095-7235', '0022-0531']
DOI: https://doi.org/10.1016/j.jet.2021.105370